Factorization of polynomials - PDFSEARCH.IO - Document Search Engine

Factorization of polynomials
Results: 202

#	Item
131	Supplementary Problems[removed]Let f (x, y) be a polynomial, which is symmetric in x and y, that is, f (x, y) = f (y, x). Put s = x + y and t = xy. Prove that there exists a polynomial g(s, t) in s and t such that g(s, t) Add to Reading List Source URL: www.mathematics.jhu.edu Language: English - Date: 2003-09-16 13:43:36 Polynomials Algebraic number theory Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Mathematics Abstract algebra Mathematical analysis
132	MDIV. Multiple divisor functions The functions τk For k ≥ 1, define τk (n) to be the number of (ordered) factorisations of n into k factors, in other words, the number of ordered k-tuples (j1 , j2 , . . . , jk ) with Add to Reading List Source URL: www.maths.lancs.ac.uk Language: English - Date: 2014-04-08 05:12:43 Calculus Continuous function Exponentiation Polynomials Algebra Differential entropy Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Exponentials
133	Supplementary Problems[removed]Exercise[removed]Let a, b, c be distinct integers. Can the polynomial (x − a)(x − b)(x − c) − 1 be factored into the product of two polynomials with integer coefficients? (2) (Exerci Add to Reading List Source URL: www.mathematics.jhu.edu Language: English - Date: 2003-10-14 14:59:47 Factorization Mathematics Polynomials Algebra
134	SERMON (South East Regional Meeting On Numbers) April[removed], 1999 University of South Carolina Columbia, South Carolina, United States Add to Reading List Source URL: www.math.sc.edu Language: English - Date: 1999-10-20 12:14:43 Analytic number theory Integer sequences Prime number Elliptic curve Bernoulli number Bateman–Horn conjecture Factorization of polynomials over a finite field and irreducibility tests Mathematics Number theory Abstract algebra
135	Modular Methods in CoCoA What are modular methods? When you have to do a quick calculation on the back of an envelope, you might calculate the sum or product of two (small) polynomials, and you would most likely use a di Add to Reading List Source URL: cocoa.dima.unige.it Language: English - Date: 2005-05-26 03:13:51 Polynomials Computer algebra Finite fields Euclidean algorithm Factorization of polynomials Integer factorization algorithms Greatest common divisor Prime number Algebraic number field Mathematics Abstract algebra Algebra
136	MAS Modula{2 Algebra System Specications Denition Modules Indexes Computer Algebra Group Add to Reading List Source URL: krum.rz.uni-mannheim.de Language: English - Date: 2007-11-19 08:07:27 Polynomials Field theory Computer algebra Commutative algebra Gröbner basis Factorization of polynomials Algebraic number field Field Content Abstract algebra Algebra Mathematics
137	Course Description for Spring 2003 Course Title: Math 788G: The Theory of Irreducible Polynomials II Instructor: Michael Filaseta Prerequisites: Graduate Standing (no prior Number Theory course is necessary; background m Add to Reading List Source URL: www.math.sc.edu Language: English - Date: 2002-08-28 10:37:15 Computer algebra Abstract algebra Irreducible polynomial Finite fields Factorization of polynomials over a finite field and irreducibility tests Factorization of polynomials Mathematics Polynomials Algebra
138	Divisibility properties of generalized Laguerre polynomials Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2010-07-28 06:32:06 Polynomials Laguerre polynomials Binomial coefficient Factorization of polynomials over a finite field and irreducibility tests Mathematics Abstract algebra Algebra
139	Generalizations of some irreducibility results by Schur T.N. Shorey and R. Tijdeman October 16, 2009 Section 1. Introduction Let a ≥ 0 and a0 , a1 , . . . , an be integers with Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2009-10-22 08:03:09 Polynomials Algebra Inverse Galois problem Laguerre polynomials Irreducible polynomial Binomial coefficient Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Abstract algebra
140 $Polynomials / Field extension / Root of unity / Minimal polynomial / Factorization of polynomials over a finite field and irreducibility tests / Partial fraction / Abstract algebra / Algebra / Mathematics$	An Introduction to Galois Theory Solutions to the exercises[removed]Chapter[removed]Clearly {n ∈ Z : n > 0 and nr = 0 for all r ∈ R} ⊆ {n ∈ Z : n > 0 and n1 = 0}. If 0 < n ∈ Z and Add to Reading List Source URL: www.maths.gla.ac.uk Language: English - Date: 2012-12-16 10:36:21 Polynomials Field extension Root of unity Minimal polynomial Factorization of polynomials over a finite field and irreducibility tests Partial fraction Abstract algebra Algebra Mathematics

UPDATE